A matroid analogue of a theorem of Brooks for graphs
نویسنده
چکیده
Brooks proved that the chromatic number of a loopless connected graph G is at most the maximum degree of G unless G is an odd cycle or a clique. This note proves an analogue of this theorem for GF (p)-representable matroids when p is prime, thereby verifying a natural generalization of a conjecture of Peter Nelson.
منابع مشابه
Structural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملA Fractional Analogue of Brooks' Theorem
Let ∆(G) be the maximum degree of a graph G. Brooks’ theorem states that the only connected graphs with chromatic number χ(G) = ∆(G) + 1 are complete graphs and odd cycles. We prove a fractional analogue of Brooks’ theorem in this paper. Namely, we classify all connected graphs G such that the fractional chromatic number χf (G) is at least ∆(G). These graphs are complete graphs, odd cycles, C 2...
متن کاملDirac’s Theorem on Simplicial Matroids
We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higherdimensional analogue of clique (or flag) complexes (case k = 2) and they are a rich new class of simplicial complexes. We show that Dirac’s theorem on chordal graphs has a higher-dimensional analogue in which graphs and clique ...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملA 2-Isomorphism Theorem for Hypergraphs
One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hyper-graphs have isomorphic associated polymatroids. 1997 Academic Press
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 53 شماره
صفحات -
تاریخ انتشار 2016